Inclusive One Jet Production With Multiple Interactions in the Regge Limit of pQCD

DIS on a two nucleon system in the regge limit is considered. In this framework a review is given of a pQCD approach for the computation of the corrections to the inclusive one jet production cross section at finite number of colors and discuss the general results.Comment: 4 pages, latex, aicproc format, Contribution to the proceedings of "Diffraction 2008", 9-14 Sep. 2008, La Londe-les-Maures, Franc

Well-Founded Belief: An Introduction

This is the Editor's Introduction to "Well-Founded Belief: New Essays on the Epistemic Basing Relation" (Routledge, 2020)

Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries

Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the finite-size correction of the free energy. The coefficient of the logarithmic correction term depends on the number of monomers present (v) and the parity of the width n of the lattice strip: the coefficient equals to v when n is odd, and v/2 when n is even. The results are generalizations of the previous results for a single monomer in an otherwise fully packed lattice of dimers.Comment: 4 pages, 2 figure

The Superstitious Lawyer's Inference

In Lehrer’s case of the superstitious lawyer, a lawyer possesses conclusive evidence for his client’s innocence, and he appreciates that the evidence is conclusive, but the evidence is causally inert with respect to his belief in his client’s innocence. This case has divided epistemologists ever since Lehrer originally proposed it in his argument against causal analyses of knowledge. Some have taken the claim that the lawyer bases his belief on the evidence as a data point for our theories to accommodate, while others have denied that the lawyer has knowledge, or that he bases his belief on the evidence. In this paper, we move the dialectic forward by way of arguing that the superstitious lawyer genuinely infers his client’s innocence from the evidence. To show that the lawyer’s inference is genuine, we argue in defense of a version of a doxastic construal of the ‘taking’ condition on inference. We also provide a pared-down superstitious lawyer-style case, which displays the key features of the original case without including its complicated and distracting features. But interestingly, although we argue that the lawyer’s belief is based on his good evidence, and is also plausibly doxastically justified, we do not argue that the lawyer knows that his client is innocent

The basing relation and the impossibility of the debasing demon

Descartes’ demon is a deceiver: the demon makes things appear to you other than as they really are. However, as Descartes famously pointed out in the Second Meditation, not all knowledge is imperilled by this kind of deception. You still know you are a thinking thing. Perhaps, though, there is a more virulent demon in epistemic hell, one from which none of our knowledge is safe. Jonathan Schaffer thinks so. The “Debasing Demon” he imagines threatens knowledge not via the truth condition on knowledge, but via the basing condition. This demon can cause any belief to seem like it’s held on a good basis, when it’s really held on a bad basis. Several recent critics, Conee, Ballantyne & Evans ) grant Schaffer the possibility of such a debasing demon, and argue that the skeptical conclusion doesn’t follow. By contrast, we argue that on any plausible account of the epistemic basing relation, the “debasing demon” is impossible. Our argument for why this is so gestures, more generally, to the importance of avoiding common traps by embracing mistaken assumptions about what it takes for a belief to be based on a reason

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most $k$. Ban and Linial conjectured that every bridgeless cubic graph admits a $2$-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph $G$ with $|E(G)| \equiv 0 \pmod 2$ has a $2$-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying $2$-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio

Size reconstructibility of graphs

The deck of a graph $G$ is given by the multiset of (unlabelled) subgraphs $\{G-v:v\in V(G)\}$. The subgraphs $G-v$ are referred to as the cards of $G$. Brown and Fenner recently showed that, for $n\geq29$, the number of edges of a graph $G$ can be computed from any deck missing 2 cards. We show that, for sufficiently large $n$, the number of edges can be computed from any deck missing at most $\frac1{20}\sqrt{n}$ cards.Comment: 15 page

Better Synchronizability Predicted by Crossed Double Cycle

In this brief report, we propose a network model named crossed double cycles, which are completely symmetrical and can be considered as the extensions of nearest-neighboring lattices. The synchronizability, measured by eigenratio $R$, can be sharply enhanced by adjusting the only parameter, crossed length $m$. The eigenratio $R$ is shown very sensitive to the average distance $L$, and the smaller average distance will lead to better synchronizability. Furthermore, we find that, in a wide interval, the eigenratio $R$ approximately obeys a power-law form as $R\sim L^{1.5}$.Comment: 4 pages, 5 figure